Two-Machine Job-Shop Scheduling with Equal Processing Times on Each Machine
نویسندگان
چکیده
منابع مشابه
Customer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملOn a parallel machine scheduling problem with equal processing times
In this paper, we give a polynomial algorithm for problem P | r j , p j = p | f j (C j), where f j is any non-decreasing function such that for any indices i and j, function f i − f j is monotonous, and a polynomial algorithm for problem P | r j , p j = p, D j | max ϕ j (C j), where ϕ j is any non-decreasing function for any j.
متن کاملTwo-Machine Flow-Shop Scheduling with Job Delivery Coordination
This study considers a class of two-machine flow-shop scheduling problems with job delivery coordination. Both vehicle capacity and transportation times are also investigated. The objective is to minimize the mean arrival time of jobs. Two integer programming models are developed to optimally solve this problem. These two integer programming models are Models 1 and 2. Model 1 adopts the concept...
متن کاملParallel Machine Problems with Equal Processing Times
The basic scheduling problem we are dealing with is the following. There are n jobs, each requiring an identical execution time. All jobs have to be processed on a set of parallel machines. Preemptions can be either allowed or forbidden. The aim is to construct a feasible schedule such that a given criterion is minimized. For a couple of problems of this type, recently the complexity status has...
متن کاملBicriterion scheduling with equal processing times on a batch processing machine
In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial algorithms for various combinations of the primary and secondary criteria. This is the Pre-Published Version.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2019
ISSN: 2227-7390
DOI: 10.3390/math7030301